Dynamic Derivations for Sequent-Based Logical Argumentation
نویسندگان
چکیده
We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks (conflicts) between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems. This framework accommodates different languages and logics in which arguments may be represented, supports a variety of attack relations, and tolerates dynamic changes in the argumentation setting by revising derivations of assertions in light of new information.
منابع مشابه
A Sequent-Based Representation of Logical Argumentation
In this paper we propose a new presentation of logic-based argumentation theory through Gentzen-style sequent calculi. We show that arguments may be represented by Gentzen-type sequents and that attacks between arguments may be represented by sequent elimination rules. This framework is logic-independent, i.e., it may be based on arbitrary languages and consequence relations. Moreover, the usua...
متن کاملSequent-based logical argumentation
We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks (conflicts) between arguments are represented by sequent elimination rules, and deductions are made according to Dung-style skeptical or credulous semantics. This framework accommodates different languages and logics in wh...
متن کاملTeaching Natural Deduction as a Subversive Activity
In this paper we argue that sequent proofs systems are a better deductive apparatus for introducing proofs to students than are natural deduction systems. Natural deduction derivations of superintuitionistic theorems (theorems of classical logic that are not intuitionistically valid) require indirect and often obtuse constructions. Constructing derivations in sequent systems is uniform, driven ...
متن کاملStructural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. This makes them amenable to elegant and concise implementations in Elf, a constraint logic programming language based on the LF logical f...
متن کاملComputational isomorphisms in classical logic
All standard ‘linear’ boolean equations are shown to be computationally realized within a suitable classical sequent calculus LKp. Specifically, LKp can be equipped with a cut-elimination compatible equivalence on derivations based upon reversibility properties of logical rules. So that any pair of derivations, without structural rules, of F ⇒ G and G ⇒ F , where F , G are first-order formulas ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014